LIZ-FACTORIZATION OF OPERATORS ON lx

نویسندگان

  • KEVIN T. ANDREWS
  • PHILIP W. SMITH
  • JOSEPH D. WARD
چکیده

Necessary and sufficent conditions are obtained for ¿(/-factorization of operators on /,. In particular it is shown that uniform invertibility of the compressions of the operator is not sufficient to insure an LU-factorization of the operator, thus answering a question of de Boor, Jia, and Pinkus. The question of when a bounded linear operator on lp, 1 < p <, oo, has an Li/-factorization has been much studied recently. Barkar and Gohberg [2] have shown that if A is an operator on lp which has an Lt/-factorization, then A and its compressions A„ = P„APn are uniformly invertible, i.e. sup„ {H^i"1!!, M"1!!} < oo. In the other direction, various classes of operators such as invertible, diagonally dominant operators on /\ [7] and invertible, totally positive operators [3, 1] on I have been shown to have L [/-factorizations. For these kinds of operators it is known [1] that their compressions satisfy a stronger condition than uniform invertibility; namely, that the inverses of the compressions are order bounded, i.e. HsupJ-d;;1! II < oo. Left open, then, is the possibility (first raised in [3] with a negative expectation) that uniform invertibility might be sufficient for a matrix operator on lx to have an LU-factorization. In this paper an example is given that shows that uniform invertibility is not sufficient for factoring an operator on lx (or /,). However, we also show that uniform invertibility of the compressions is sufficient to ensure an LU-factorization when the operator has an inverse whose columns decay at a certain rate away from the diagonal. Among the operators with this property are the banded operators. We wish to express thanks to the referee for several helpful suggestions. We now fix some terminology and notation. If x = (x,) is an element of /x we denote its usual projection onto the span of the first n basis vectors by P„x. A bounded linear operator A on /, is said to be upper (respectively lower) triangular if P„AP„ = APn (respectively P„A) for all n. We say that A is unit upper (lower) triangular if it is upper (lower) triangular and its diagonal entries in the matrix representation for A relative to the usual basis e¡ of l1 are all ones. An operator A is said to have an L[/-factorization (relative to the usual basis e¡ of /,) if there exist invertible operators L and U so that A = LU and the operators L, L'1 are unit lower triangular while U, U'1 are upper triangular. An operator A is said to be Received by the editors June 10, 1985. 1980 Mathematics Subject Classification. Primary 47A68; Secondary 46E40.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From torsion theories to closure operators and factorization systems

Torsion theories are here extended to categories equipped with an ideal of 'null morphisms', or equivalently a full subcategory of 'null objects'. Instances of this extension include closure operators viewed as generalised torsion theories in a 'category of pairs', and factorization systems viewed as torsion theories in a category of morphisms. The first point has essentially been treated in [15].

متن کامل

On the space of Fredholm operators

We compare various topologies on the space of (possibly unbounded) Fredholm selfadjoint operators and explain their K-theoretic relevance.∗ Introduction The work of Atiyah and Singer on the index of elliptic operators on manifolds has singled out the role of the space of bounded Fredholm operators in topology. It is a classifying space for a very useful functor, the topological K-theory. This m...

متن کامل

On the WZ Factorization of the Real and Integer Matrices

The textit{QIF}  (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ}  factorization. The  WZ factorization can be faster than the textit{LU} factorization  because,  it performs the simultaneous evaluation of two columns or two rows. Here, we present a  method for computing the real and integer textit{WZ} and  textit{ZW} factoriz...

متن کامل

$n$-factorization Property of Bilinear Mappings

In this paper, we define a new concept of factorization for a bounded bilinear mapping $f:Xtimes Yto Z$, depended on  a natural number $n$ and a cardinal number $kappa$; which is called $n$-factorization property of level $kappa$. Then we study the relation between $n$-factorization property of  level $kappa$ for $X^*$ with respect to $f$ and automatically boundedness and $w^*$-$w^*$-continuity...

متن کامل

On semi weak factorization structures

In this article the notions of semi weak orthogonality and semi weak factorization structure in a category $mathcal X$ are introduced. Then the relationship between semi weak factorization structures and quasi right (left) and weak factorization structures is given. The main result is a characterization of semi weak orthogonality, factorization of morphisms, and semi weak factorization structur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010